0.08/0.15	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.18	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.38	% Computer   : n029.cluster.edu
0.14/0.38	% Model      : x86_64 x86_64
0.14/0.38	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.38	% Memory     : 8042.1875MB
0.14/0.38	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.38	% CPULimit   : 1200
0.14/0.38	% WCLimit    : 120
0.14/0.38	% DateTime   : Tue Jul 13 15:29:40 EDT 2021
0.14/0.38	% CPUTime    : 
0.14/0.38	% Number of cores: 8
0.14/0.38	% Python version: Python 3.6.8
0.14/0.38	# Version: 2.6rc1-ho
0.14/0.40	# No SInE strategy applied
0.14/0.40	# Trying AutoSched0 for 59 seconds
0.20/0.50	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.20/0.50	# and selection function SelectMaxLComplexAvoidPosPred.
0.20/0.50	#
0.20/0.50	# Preprocessing time       : 0.092 s
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.20/0.50	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.20/0.50	thf(def_n_is, axiom, (n_is)=(^[X589:$i, X590:$i]:(X589)=(X590)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.20/0.50	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.20/0.50	thf(satz28h, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X310:$i]:in @ X310 @ nat) @ (^[X311:$i]:n_is @ (n_pl @ (n_ts @ X1 @ X311) @ X311) @ (n_ts @ (ordsucc @ X1) @ X311))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz28h)).
0.20/0.50	thf(satz28d, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X247:$i]:in @ X247 @ nat) @ (^[X248:$i]:n_is @ (n_ts @ (ordsucc @ X1) @ X248) @ (n_pl @ (n_ts @ X1 @ X248) @ X248))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz28d)).
0.20/0.50	thf(c_0_6, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.20/0.50	thf(c_0_7, axiom, (n_is)=(^[X589:$i, X590:$i]:(X589)=(X590)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.20/0.50	thf(c_0_8, negated_conjecture, ~(![X2208:$i]:(in @ X2208 @ nat=>![X2212:$i]:(in @ X2212 @ nat=>(n_pl @ (n_ts @ X2208 @ X2212) @ X2212)=(n_ts @ (ordsucc @ X2208) @ X2212)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz28h]), c_0_6]), c_0_7])).
0.20/0.50	thf(c_0_9, plain, ![X1407:$i]:(in @ X1407 @ nat=>![X1411:$i]:(in @ X1411 @ nat=>(n_ts @ (ordsucc @ X1407) @ X1411)=(n_pl @ (n_ts @ X1407 @ X1411) @ X1411))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz28d, c_0_6]), c_0_7])).
0.20/0.50	thf(c_0_10, negated_conjecture, (in @ esk90_0 @ nat&(in @ esk91_0 @ nat&(n_pl @ (n_ts @ esk90_0 @ esk91_0) @ esk91_0)!=(n_ts @ (ordsucc @ esk90_0) @ esk91_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
0.20/0.50	thf(c_0_11, plain, ![X3320:$i, X3321:$i]:(~in @ X3320 @ nat|(~in @ X3321 @ nat|(n_ts @ (ordsucc @ X3320) @ X3321)=(n_pl @ (n_ts @ X3320 @ X3321) @ X3321))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
0.20/0.50	thf(c_0_12, negated_conjecture, (n_pl @ (n_ts @ esk90_0 @ esk91_0) @ esk91_0)!=(n_ts @ (ordsucc @ esk90_0) @ esk91_0), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.50	thf(c_0_13, plain, ![X1:$i, X4:$i]:((n_ts @ (ordsucc @ X1) @ X4)=(n_pl @ (n_ts @ X1 @ X4) @ X4)|~in @ X1 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.50	thf(c_0_14, negated_conjecture, in @ esk91_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.50	thf(c_0_15, negated_conjecture, in @ esk90_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.50	thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14]), c_0_15])]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Proof object total steps             : 17
0.20/0.50	# Proof object clause steps            : 5
0.20/0.50	# Proof object formula steps           : 12
0.20/0.50	# Proof object conjectures             : 7
0.20/0.50	# Proof object clause conjectures      : 4
0.20/0.50	# Proof object formula conjectures     : 3
0.20/0.50	# Proof object initial clauses used    : 4
0.20/0.50	# Proof object initial formulas used   : 6
0.20/0.50	# Proof object generating inferences   : 1
0.20/0.50	# Proof object simplifying inferences  : 3
0.20/0.50	# Training examples: 0 positive, 0 negative
0.20/0.50	# Parsed axioms                        : 439
0.20/0.50	# Removed by relevancy pruning/SinE    : 0
0.20/0.50	# Initial clauses                      : 705
0.20/0.50	# Removed in clause preprocessing      : 179
0.20/0.50	# Initial clauses in saturation        : 526
0.20/0.50	# Processed clauses                    : 165
0.20/0.50	# ...of these trivial                  : 0
0.20/0.50	# ...subsumed                          : 15
0.20/0.50	# ...remaining for further processing  : 150
0.20/0.50	# Other redundant clauses eliminated   : 44
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 0
0.20/0.50	# Backward-rewritten                   : 1
0.20/0.50	# Generated clauses                    : 463
0.20/0.50	# ...of the previous two non-trivial   : 399
0.20/0.50	# Contextual simplify-reflections      : 1
0.20/0.50	# Paramodulations                      : 366
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 55
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 132
0.20/0.50	#    Positive orientable unit clauses  : 43
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 3
0.20/0.50	#    Non-unit-clauses                  : 86
0.20/0.50	# Current number of unprocessed clauses: 744
0.20/0.50	# ...number of literals in the above   : 3147
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 1
0.20/0.50	# Clause-clause subsumption calls (NU) : 3436
0.20/0.50	# Rec. Clause-clause subsumption calls : 1779
0.20/0.50	# Non-unit clause-clause subsumptions  : 16
0.20/0.50	# Unit Clause-clause subsumption calls : 476
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 2
0.20/0.50	# BW rewrite match successes           : 1
0.20/0.50	# Condensation attempts                : 0
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 114414
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.103 s
0.20/0.50	# System time              : 0.016 s
0.20/0.50	# Total time               : 0.119 s
0.20/0.50	# Maximum resident set size: 2400 pages
0.20/0.50	EOF